|
|
Testing of Coverage Path Planning
Krajňák, Damián ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
The aim of this thesis is to design and implement a program with graphical user interface, designed for algorithm testing and complete coverage of a given area. Problem was solved by decomposition of a 2D space into cells, which were sequentially covered. The areas of individual cells are covered in a way, that is selected based on the selected algorithm. Created solution provides a draft of an optimal pathway for robots intended for complete coverage of space, which are, for example, autonomous vacuum cleaners, cleaning robots, robotic lawn mowers etc.
|
|
|
Visualisation of Path-Finding for Robot
Sykala, Vít ; Orság, Filip (referee) ; Rozman, Jaroslav (advisor)
This bachelor´s thesis is explanation of algorithms for finding and planning robot motion in known space. First part is about margin and explanation of algorithms: Roadmaps and Cell decomposition. Next part is about progress of creating Java applets for visualization of these methods. Visualization of create Visibility graph and Trapezoidal decomposition in the concrete. Web presentation about these algorithms was too created as a part of this bachelor´s thesis. Here can be seen described Java applets.
|
|
|
Testing of Coverage Path Planning
Krajňák, Damián ; Janoušek, Vladimír (referee) ; Rozman, Jaroslav (advisor)
The aim of this thesis is to design and implement a program with graphical user interface, designed for algorithm testing and complete coverage of a given area. Problem was solved by decomposition of a 2D space into cells, which were sequentially covered. The areas of individual cells are covered in a way, that is selected based on the selected algorithm. Created solution provides a draft of an optimal pathway for robots intended for complete coverage of space, which are, for example, autonomous vacuum cleaners, cleaning robots, robotic lawn mowers etc.
|
|
|
Visualisation of Path-Finding for Robot
Sykala, Vít ; Orság, Filip (referee) ; Rozman, Jaroslav (advisor)
This bachelor´s thesis is explanation of algorithms for finding and planning robot motion in known space. First part is about margin and explanation of algorithms: Roadmaps and Cell decomposition. Next part is about progress of creating Java applets for visualization of these methods. Visualization of create Visibility graph and Trapezoidal decomposition in the concrete. Web presentation about these algorithms was too created as a part of this bachelor´s thesis. Here can be seen described Java applets.
|
guest ::
